Surface words are determined by word measures on groups

نویسندگان

چکیده

Every word $w$ in a free group naturally induces probability measure on every compact $G$. For example, if $w=\left[x,y\right]$ is the commutator word, random element sampled by $w$-measure given $\left[g,h\right]$ of two independent, Haar-random elements Back 1896, Frobenius showed that $G$ finite and $\psi$ an irreducible character, then expected value $\psi\left(\left[g,h\right]\right)$ $\frac{1}{\psi\left(e\right)}$. This true for any group, completely determines $\left[x,y\right]$-measure these groups. An analogous result holds with replaced surface word. We prove converse to this theorem: same as $\left[x,y\right]$ then, up automorphism equal $\left[x,y\right]$. The when proof relies analysis measures unitary groups orthogonal groups, which appears separate papers, new generalized symmetric we develop here.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Word Measures on Unitary Groups

We combine concepts from random matrix theory and free probability together with ideas from the theory of commutator length in groups and maps from surfaces, and establish new connections between the two. More particularly, we study measures induced by free words on the unitary groups U (n). Every word w in the free group Fr on r generators determines a word map from U (n) to U (n), defined by ...

متن کامل

On Infinite Words Determined by Indexed Languages

We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other directi...

متن کامل

On Infinite Words Determined by Stack Automata

We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger clas...

متن کامل

On Infinite Words Determined by L Systems

A deterministic L system generates an infinite word α if each word in its derivation sequence is a prefix of the next, yielding α as a limit. We generalize this notion to arbitrary L systems via the concept of prefix languages. A prefix language is a language L such that for all x, y ∈ L, x is a prefix of y or y is a prefix of x. Every infinite prefix language determines a single infinite word....

متن کامل

Some Words on Word

In many disciplines, the notion of a word is of central importance. For instance, morphology studies le mot comme tel, pris isolément (Mel’čuk, 1993 [74]). In the philosophy of language the word was often considered to be the primary bearer of meaning. Lexicography has as its fundamental role to catalogue the words of a language. Thus, there has been a lot of work on words and on the nature of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2113-5